Implication of clauses is undecidable
نویسندگان
چکیده
منابع مشابه
Generalization of Clauses under Implication
In the area of inductive learning, generalization is a main operation, and the usual deenition of induction is based on logical implication. Recently there has been a rising interest in clausal representation of knowledge in machine learning. Almost all inductive learning systems that perform generalization of clauses use the relation-subsumption instead of implication. The main reason is that ...
متن کاملUndecidable problems for propositional calculi with implication
In this article, we deal with propositional calculi over a signature containing the classical implication → with the rules of modus ponens and substitution. For these calculi we consider few recognizing problems such as recognizing derivations, extensions, completeness, and axiomatizations. The main result of this paper is to prove that the problem of recognizing extensions is undecidable for e...
متن کاملGeneralization of Clauses under Implication 2
In the area of inductive learning, generalization is a main operation, and the usual deenition of induction is based on logical implication. Recently there has been a rising interest in clausal representation of knowledge in machine learning. Almost all inductive learning systems that perform generalization of clauses use the relation-subsumption instead of implication. The main reason is that ...
متن کاملSystem NEL is Undecidable
System NEL is a conservative extension of multiplicative exponential linear logic (extended by the rules mix and nullary mix) by a self-dual noncommutative connective called seq which has an intermediate position between the connectives par and times. In this paper, I will show that system NEL is undecidable by encoding two counter machines into NEL. Although the encoding is simple, the proof o...
متن کاملRigidity is undecidable
We show that the problem ‘whether a finite set of regular-linear axioms defines a rigid theory’ is undecidable. 2010 Mathematical Subject Classification 03D35, 03C05, 03G30, 18C10, 18C15
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1988
ISSN: 0304-3975
DOI: 10.1016/0304-3975(88)90146-6